Theory and applications of satisfiability testing (SAT 2006)Biere, Armin; Gomes, Carla P.Lecture notes in computer science. 2006, issn 0302-9743, isbn 3-540-37206-7, 1Vol, XII-438 p, isbn 3-540-37206-7Conference Proceedings

Improved approximation algorithms for MAX NAE-SAT and MAX SATAVIDOR, Adi; BERKOVITCH, Ido; ZWICK, Uri et al.Lecture notes in computer science. 2006, pp 27-40, issn 0302-9743, isbn 3-540-32207-8, 1Vol, 14 p.Conference Paper

A scalable algorithm for minimal unsatisfiable core extractionDERSHOWITZ, Nachum; HANNA, Ziyad; NADEL, Alexander et al.Lecture notes in computer science. 2006, pp 36-41, issn 0302-9743, isbn 3-540-37206-7, 1Vol, 6 p.Conference Paper

Effective preprocessing in SAT through variable and clause eliminationEEN, Niklas; BIERE, Armin.Lecture notes in computer science. 2005, pp 61-75, issn 0302-9743, isbn 3-540-26276-8, 15 p.Conference Paper

Categorisation of clauses in conjunctive normal forms : Minimally unsatisfiable sub-clause-sets and the lean kernelKULLMANN, Oliver; LYNCE, Ines; MARQUES-SILVA, Joao et al.Lecture notes in computer science. 2006, pp 22-35, issn 0302-9743, isbn 3-540-37206-7, 1Vol, 14 p.Conference Paper

A new set of algebraic benchmark problems for SAT solversMEIER, Andreas; SORGE, Volker.Lecture notes in computer science. 2005, pp 459-466, issn 0302-9743, isbn 3-540-26276-8, 8 p.Conference Paper

Satisfiability Modulo Theories: Introduction and ApplicationsDE MOURA, Leonardo; BJØRNER, Nikolaj.Communications of the ACM. 2011, Vol 54, Num 9, pp 69-77, issn 0001-0782, 9 p.Article

Solving weighted MAX-SAT via global equilibrium searchSHYLO, Oleg V; PROKOPYEV, Oleg A; SHYLO, Vladimir P et al.Operations research letters. 2008, Vol 36, Num 4, pp 434-438, issn 0167-6377, 5 p.Article

On the parameterized complexity of exact satisfiability problemsKNEIS, Joachim; MOLLE, Daniel; RICHTER, Stefan et al.Lecture notes in computer science. 2005, pp 568-579, issn 0302-9743, isbn 3-540-28702-7, 12 p.Conference Paper

Local search for unsatisfiabilityPRESTWICH, Steven; LYNCE, Ines.Lecture notes in computer science. 2006, pp 283-296, issn 0302-9743, isbn 3-540-37206-7, 1Vol, 14 p.Conference Paper

Boolean Satisfiability From Theoretical Hardness to Practical SuccessMALIK, Sharad; LINTAO ZHANG.Communications of the ACM. 2009, Vol 52, Num 8, pp 76-82, issn 0001-0782, 7 p.Article

Constraints and Al planningNAREYEK, Alexander; FREUDER, Eugene C; FOURER, Robert et al.IEEE intelligent systems. 2005, Vol 20, Num 2, pp 62-72, issn 1541-1672, 11 p.Article

APPSSAT : Approximate probabilistic planning using stochastic satisfiabilityMAJERCIK, Stephen M.International journal of approximate reasoning. 2007, Vol 45, Num 2, pp 402-419, issn 0888-613X, 18 p.Conference Paper

How many solutions does a sat instance have?PARI, Pushkin R; LIN YUAN; GANG QU et al.IEEE International Symposium on Circuits and Systems. 2004, pp 209-212, isbn 0-7803-8251-X, 4 p.Conference Paper

How good are branching rules in DPLL?MING OUYANG.Discrete applied mathematics. 1998, Vol 89, Num 1-3, pp 281-286, issn 0166-218XArticle

sharpSAT : Counting models with advanced component caching and implicit BCPTHURLEY, Marc.Lecture notes in computer science. 2006, pp 424-429, issn 0302-9743, isbn 3-540-37206-7, 1Vol, 6 p.Conference Paper

An algorithm for the SAT problem for formulae of linear lengthWAHLSTRÖM, Magnus.Lecture notes in computer science. 2005, pp 107-118, issn 0302-9743, isbn 3-540-29118-0, 1Vol, 12 p.Conference Paper

Test instance generation for MAX 2SATMOTOKI, Mistuo.Lecture notes in computer science. 2005, pp 787-791, issn 0302-9743, isbn 3-540-29238-1, 1Vol, 5 p.Conference Paper

SATO : An efficient propositional proverZHANG, H.Lecture notes in computer science. 1997, pp 272-275, issn 0302-9743, isbn 3-540-63104-6Conference Paper

Differential approximation of MIN SAT, MAX SAT and related problemsESCOFFIER, Bruno; PASCHOS, Vangelis Th.Lecture notes in computer science. 2005, issn 0302-9743, isbn 3-540-25860-4, 4Vol, part IV, 192-201Conference Paper

On finding all minimally unsatisfiable subformulasLIFFITON, Mark H; SAKALLAH, Karem A.Lecture notes in computer science. 2005, pp 173-186, issn 0302-9743, isbn 3-540-26276-8, 14 p.Conference Paper

What Makes a Good Decision? Robust Satisficing as a Normative Standard of Rational Decision MakingSCHWARTZ, Barry; BEN-HAIM, Yakov; DACSO, Cliff et al.Journal for the theory of social behaviour. 2011, Vol 41, Num 2, issn 0021-8308, 209-227, 230 [20 p.]Article

Optimization and improvement = Optimisation et améliorationWEIRICH, Paul.Philosophical studies. 2010, Vol 148, Num 3, pp 467-475, issn 0031-8116, 9 p.Article

Searching while keeping a trace : The evolution from satisfiability to knowledge compilationDARWICHE, Adnan.Lecture notes in computer science. 2006, pp 4-20, issn 0302-9743, isbn 3-540-37187-7, 1Vol, 17 p.Conference Paper

Page / 47